A scalable parallel factorization of finite element matrices with distributed Schur complements
نویسندگان
چکیده
We consider the parallel factorization of sparse finite element matrices on distributed memory machines. Our method is based on a nested dissection approach combined with a cyclic re-distribution of the interface Schur complements. We present a detailed definition of the parallel method, and the well-posedness and the complexity of the algorithm is analyzed. A lean and transparent functional interface to existing finite element software is defined, and the performance is demonstrated for several representative examples. Copyright © 0000 John Wiley & Sons, Ltd.
منابع مشابه
Algebraic Multilevel Preconditioning of Finite Element Matrices Based on Element Agglomeration
We consider an algebraic multilevel preconditioning method for SPD matrices resulting from finite element discretization of elliptic PDEs. In particular, we focus on non-M matrices. The method is based on element agglomeration and assumes access to the individual element matrices. The coarse-grid element matrices are simply Schur complements computed from local neighborhood matrices (agglomerat...
متن کاملEfficient Preconditioning of hp-FEM Matrices by Hierarchical Low-Rank Approximations
In this talk I will introduce a preconditioner based on low-rank compression of Schur complements. The construction is inspired by the well-known nested dissection strategy, and relies on the assumption that the Schur complements that arise in the elimination process can be approximated, to high precision, by compressible matrices. The preconditioner is built as an approximate LDM t factorizati...
متن کاملPreconditioning of Boundary Value Problems Using Elementwise Schur Complements
Based on a particular node ordering and corresponding block decomposition of the matrix we analyse an e cient, algebraic multilevel preconditioner for the iterative solution of nite element discretizations of elliptic boundary value problems. Thereby an analysis of a new version of block-factorization preconditioning methods is presented. The approximate factorization requires an approximation ...
متن کاملSpectral analysis of coupled PDEs and of their Schur complements via the notion of Generalized Locally Toeplitz sequences
We consider large linear systems of algebraic equations arising from the Finite Element approximation of coupled partial differential equations. As case study we focus on the linear elasticity equations, formulated as a saddle point problem to allow for modeling of purely incompressible materials. Using the notion of the so-called spectral symbol in the Generalized Locally Toeplitz (GLT) settin...
متن کاملHighly Scalable Parallel Algorithms for Sparse Matrix Factorization
In this paper, we describe scalable parallel algorithms for sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1024 processors on a Cray T3D parallel computer. Through our analysis and experimental results, we demonstrate that our algorithms substantially improve the state of the art in parallel direct solution of sparse linear sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016